package com.zijie;

import java.util.Scanner;

public class Q2 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int dis = scanner.nextInt();
        int[] a = new int[n - 1];

        for (int i = 0; i < n - 1; i++) {
            a[i] = scanner.nextInt();
        }

        int countFront = 0;
        int countBack = 0;

        for (int num : a) {
            int minDist = num * 400;
            int maxDist = num * 400 + 399;
            if (minDist > dis) {
                countFront++;
                countBack++;
            } else if (maxDist>dis) {
                countBack++;
            }
        }
        int bestRank = countFront + 1;
        int worstRank = countBack + 1;
        System.out.println(bestRank + " " + worstRank);
    }
}
